Time-bounded reachability in tree-structured QBDs by abstraction
نویسندگان
چکیده
منابع مشابه
Time-Bounded Reachability in Continuous-Time Markov Decision Processes
This paper solves the problem of computing the maximum and minimum probability to reach a set of goal states within a given time bound for locally uniform continuous-time Markov decision processes (CTMDPs). As this model allows for nondeterministic choices between exponentially delayed transitions, we define total time positional (TTP) schedulers which rely on the CTMDP’s current state and the ...
متن کاملContinuous-Time Stochastic Games with Time-Bounded Reachability
We study continuous-time stochastic games with time-bounded reachability objectives and time-abstract strategies. We show that each vertex in such a game has a value (i.e., an equilibrium probability), and we classify the conditions under which optimal strategies exist. Further, we show how to compute εoptimal strategies in finite games and provide detailed complexity estimations. Moreover, we ...
متن کاملTime-Bounded Reachability in Distributed Input/Output Interactive Probabilistic Chains
We develop an algorithm to compute timed reachability probabilities for distributed models which are both probabilistic and nondeterministic. To obtain realistic results we consider the recently introduced class of (strongly) distributed schedulers, for which no analysis techniques are known. Our algorithm is based on reformulating the nondeterministic models as parametric ones, by interpreting...
متن کاملTime-bounded Reachability for Hybrid Automata: Complexity and Fixpoints
In this paper, we study the time-bounded reachability problem for rectangular hybrid automata with non-negative rates (RHA). This problem was recently shown to be decidable [5] (even though the unbounded reachability problem for even very simple classes of hybrid automata is well-known to be undecidable). However, [5] does not provide a precise characterisation of the complexity of the time-bou...
متن کاملOn Reachability for Hybrid Automata over Bounded Time
This paper investigates the time-bounded version of the reachability problem for hybrid automata. This problem asks whether a given hybrid automaton can reach a given target location within T time units, where T is a constant rational value. We show that, in contrast to the classical (unbounded) reachability problem, the timed-bounded version is decidable for rectangular hybrid automata provide...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Performance Evaluation
سال: 2011
ISSN: 0166-5316
DOI: 10.1016/j.peva.2010.04.002